Maximum induced forests in random graphs
نویسندگان
چکیده
We prove that with high probability maximum sizes of induced forests in dense binomial random graphs are concentrated two consecutive values.
منابع مشابه
On Maximum Induced Forests in Graphs
We consider the problem of determining the order of maximum induced forest, I(G), of a graph G. In this paper we prove that if R(d) is the graph of realizations of a degree sequence d and if G and G′ are adjacent in R(d), then |I(G) − I(G′)| ≤ 1. With the fact on the connectivity of the graph of realizations, it follows that for any graphic degree sequence d, there exist integers a and b such t...
متن کاملForests in Random Graphs
Let G be a graph and let I(G) be defined by I(G) = max{|F | : F is an induced forest in G}. Let d = (d1, d2, . . . , dn) be a graphic degree sequence such that d1 ≥ d2 ≥ · · · ≥ dn ≥ 1. By using the probabilistic method, we prove that if G is a graph with degree sequence d, then I(G) ≥ 2 n ∑
متن کاملMaximum Induced Forests in Graphs of Bounded Treewidth
Given a nonnegative integer d and a graph G, let fd(G) be the maximum order of an induced forest in G having maximum degree at most d. We seek lower bounds for fd(G) based on the order and treewidth of G. We show that, for all k, d > 2 and n > 1, if G is a graph with order n and treewidth at most k, then fd(G) > ⌈(2dn+ 2)/(kd+ d+ 1)⌉, unless G ∈ {K1,1,3,K2,3} and k = d = 2. We give examples tha...
متن کاملMaximum Induced Matchings of Random Cubic Graphs
We present a heuristic for finding a large induced matching of cubic graphs. We analyse the performance of this heuristic, which is a random greedy algorithm, on random cubic graphs using differential equations and obtain a lower bound on the expected size of the induced matching, M, returned by the algorithm. A corresponding upper bound is derived by means of a direct expectation argument. We ...
متن کاملMaximum matching on random graphs
– The maximum matching problem on random graphs is studied analytically by the cavity method of statistical physics. When the average vertex degree c is larger than 2.7183, groups of max-matching patterns which differ greatly from each other gradually emerge. An analytical expression for the max-matching size is also obtained, which agrees well with computer simulations. Discussion is made on t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2021
ISSN: ['1872-6771', '0166-218X']
DOI: https://doi.org/10.1016/j.dam.2021.08.018